منابع مشابه
Parallel machine scheduling with batch delivery costs
We consider a scheduling problem in which n independent and simultaneously available jobs are to be processed on m parallel machines. The jobs are delivered in batches and the delivery date of a batch is equal to the completion time of the last job in the batch. The delivery cost depends on the number of deliveries. The objective is to minimize the sum of the total #ow time and delivery cost. W...
متن کاملParallel Machine Batch Scheduling
The problem of scheduling G groups of jobs on m unrelated parallel machines is considered. Each group consists of several identical jobs. Implicit in a schedule is a partition of a group into batches; all jobs of a batch are processed jointly. It is possible for diierent batches of the same group to be processed concurrently on diierent machines. However, at any time, a batch can be processed o...
متن کاملSingle Machine Scheduling with batch Delivery to Multiple Customers in a Star-shaped Network
In this paper, we consider the scheduling problem in which the jobs are first processed on a single machine and then delivered in batches by a single vehicle with limited capacity to the respective customers located at the vertices of a star-shaped network. The goal is to minimize the makespan. We present a 3/2-approximation algorithm for the identical job size case and a 2-approximation algori...
متن کاملUnbounded parallel batch scheduling with job delivery to minimize makespan
We consider unbounded parallel batch scheduling with job delivery to minimize makespan. When the jobs have identical size, we provide a polynomial-time algorithm. When the jobs have non-identical sizes, we provide a heuristic with a worst-case performance ratio 7/4. c © 2008 Published by Elsevier B.V.
متن کاملBatch delivery scheduling with batch delivery cost on a single machine
We consider a scheduling problem in which n independent and simultaneously available jobs are to be processed on a single machine. The jobs are delivered in batches and the delivery date of a batch equals the completion time of the last job in the batch. The delivery cost depends on the number of deliveries. The objective is to minimize the sum of the total weighted flow time and delivery cost....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2015
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2015/247356